Counting Preimages
نویسنده
چکیده
For noninvertible maps, mainly subshifts of finite type and piecewise monotone interval maps, we investigate what happens if we follow backward trajectories, random in the sense that at each step every preimage can be chosen with equal probability. In particular, we ask what happens if we try to compute the entropy this way. It tuns out that instead of the topological entropy we get the metric entropy of a special measure, which we call the fair measure. In general this entropy (the fair entropy) is smaller than the topological entropy. In such a way, for the systems that we consider, we get a new natural measure and a new invariant of topological conjugacy.
منابع مشابه
Algorithms for computing preimages of cellular automata configurations
This paper investigates preimages (ancestors or past configurations) of specified configurations of one-dimensional cellular automata. Both counting and listing of preimages are discussed. The main graphical tools used are the de Bruijn diagram, and its extension the preimage network, which is created by concatenating de Bruijn diagrams. The counting of preimages is performed as multiplication ...
متن کاملCounting Preimages of Homogeneous Configurations in 1-Dimensional Cellular Automata
A cellular automaton (CA) is in a homogeneous configuration if every cell has the same state. The preimages of a configuration s are those configurations which evolve to s within a single time step. We present two methods of finding the total number of preimages for a given homogeneous configuration. The first is more intuitive, and gives a clear picture of how the number of preimages varies wi...
متن کاملRelations between stable dimension and the preimage counting function on basic sets with overlaps
In this paper we study non-invertible hyperbolic maps f and the relation between the stable dimension (i.e the Hausdorff dimension of the intersection between local stable manifolds of f and a given basic set Λ) and the preimage counting function of the map f restricted to the fractal set Λ. The case of diffeomorphisms on surfaces was considered in [5] where thermodynamic formalism was used to ...
متن کاملEfficient algorithms for counting parameterized list H-colorings
We study the fixed parameter tractability of the counting version of a parameterization of the restrictive list H-coloring problem. The parameterization is defined by fixing the number of preimages of a subset C of the vertices in H through a weight assignment K on C. We show the fixed parameter tractability of counting the number of list (H,C,K)-colorings, for the case in which (H,C,K) is simp...
متن کاملLectures on Nevanlinna theory
Value distribution of a rational function f is controlled by its degree d, which is the number of preimages of a generic point. If we denote by n(a) the number of solutions of the equation f(z) = a, counting multiplicity, in the complex plane C, then n(a) ≤ d for all a ∈ C with equality for all a with one exception, namely a = f(∞). The number of critical points of f in C, counting multiplicity...
متن کاملAncestors, descendants, and gardens of Eden in reaction systems
This paper analyses several problems related to finding and counting ancestor and descendant states, as well as gardens of Eden (i.e., states without predecessors) in reaction systems. The focus is on the complexity of finding and counting preimages and ancestors that are minimal with respect to cardinality. It turns out that the problems concerning gardens of Eden seem to require the presence ...
متن کامل